منابع مشابه
A hybrid metaheuristic approach to the university course timetabling problem
This paper describes the development of a novel metaheuristic that combines an electromagnetic-like mechanism (EM) and the great deluge algorithm (GD) for the University course timetabling problem. This well-known timetabling problem assigns lectures to specific numbers of timeslots and rooms maximizing the overall quality of the timetable while taking various constraints into account. EM is a ...
متن کاملThe University Course Timetabling Problem with a 3-phase approach
This paper describes the University Course Timetabling Problem (UCTP) used in the International Timetabling Competition 2003 organized by the Metaheuristics Network and presents a state-of-the-art heuristic approach towards the solution of the competition instances. It is a greatly improved version of the winning competition entry. The heuristic is divided into three phases: at first, a feasibl...
متن کاملModeling and Solution of a Complex University Course Timetabling Problem
The modeling and solution approaches being used to automate construction of course timetables at a large university are discussed. A course structure model is presented that allows this complex real-world problem to be described using a classical formulation. The problem is then tackled utilizing a course timetabling solver model that transforms it into a constraint satisfaction and optimizatio...
متن کاملSOLVING UNIVERSITY COURSE TIMETABLING PROBLEM USING GENETIC ALGORITHM Master Thesis
This is to certify that we have read this thesis and that we find it fully adequate in scope, quality and content, as a thesis for the degree of Master of Science. continously asking me " how is the thesis going? " , because she encouraged me to persevere without knowing it. Also I would like to thank to my best friend, my colleague, my dear husband Tarkan Aydın for his understanding, patience,...
متن کاملHardness Prediction for the University Course Timetabling Problem
This paper presents an attempt to find a statistical model that predicts the hardness of the University Course Timetabling Problem by analyzing instance properties. The model may later be used for better understanding what makes a particular instance hard. It may also be used for tuning the algorithm actually solving that problem instance. The paper introduces the definition of hardness, explai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ORiON
سال: 2003
ISSN: 2224-0004
DOI: 10.5784/4-2-487